Iterative behaviour of one-dimensional threshold automata
نویسندگان
چکیده
This paper presents two results on the dynamical behaviour of some finite binary one-dimensional threshold automata, where the interaction coefficient between two cells i, j is a decreasing function of ii-jl.
منابع مشابه
Modeling the main and maximum subautomata of an active general fuzzy automaton
In this paper, subcategories with threshold c are examined from an active general fuzzy automaton and the generator from an active general fuzzy automaton is defined and the connections between them are examined. Then, under the main and maximum automata with threshold c, one of the active general fuzzy automata will be defined, and it will be proved that each active general fuzzy automaton can...
متن کاملFast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnected interacting finite automata. The distinguished automaton at the origin, the communication cell, is connected to the outside world and fetches the input sequentially. Often in the literature this model is referred to as iterative array. We investigate d-dimensional iterative arrays and one-dim...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA necessary condition for boundary sensitivity of attractive non-linear stochastic cellular automata in Z2
This paper tackles the question of the environmental robustness of a particular class of two-dimensional finite threshold Boolean cellular automata when they are subjected to distinct fixed boundary instances. More precisely, focusing on a non-linear stochastic version of the classical threshold function governing the evolution of formal neural networks, we show the existence of a necessary con...
متن کاملHYPERGROUPS AND GENERAL FUZZY AUTOMATA
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 8 شماره
صفحات -
تاریخ انتشار 1984